Approximate and Iterative Methods

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative and non-iterative, full and approximate factorization methods for multidimensional reaction-diffusion equations

A variety of second-order accurate, in both space and time, full and approximate factorization methods for the numerical solution of two-dimensional reaction–diffusion equations is presented. These methods may use time linearization and yield linearly implicit techniques and one-dimensional operators in each direction. It is shown that, if the factorization errors are neglected, linearly implic...

متن کامل

Approximate Solution of Weakly Singular Integral Equations by Iterative Methods

In present paper we elaborated the numerical schemes of iterative methods for an approximate solution of weak singular integral equations with logarithmic Kernel. The equation is examined in a pair of spaces. The results obtained could be used for any pair of the functional spaces where the problem of finding the solution of weak singular integral equations is correctly formulated problem by Ti...

متن کامل

Approximate Inverse Preconditioning of Iterative Methods for Nonsymmetric Linear Systems

A method for computing an incomplete factorization of the inverse of a nonsymmetric matrix A is presented. The resulting factorized sparse approximate inverse is used as a preconditioner in the iterative solution of Ax = b by Krylov subspace methods. 1. Introduction. We describe a method for computing an incomplete factorization of the inverse of a general sparse matrix A 2 IR nn. The resulting...

متن کامل

Weights in block iterative methods

In this paper we introduce a sequential block iterative method and its simultaneous version with op-timal combination of weights (instead of convex combination) for solving convex feasibility problems.When the intersection of the given family of convex sets is nonempty, it is shown that any sequencegenerated by the given algorithms converges to a feasible point. Additionally for linear feasibil...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Dynamics in Nature and Society

سال: 2015

ISSN: 1026-0226,1607-887X

DOI: 10.1155/2015/340293